Error in Enumerable Sequence Prediction

نویسنده

  • Nick Hay
چکیده

We outline a method for quantifying the error of a sequence prediction. With sequence predictions represented by semimeasures ν(x) we define their error to be − log2 ν(x). We note that enumerable semimeasures are those which model the sequence as the output of a computable system given unknown input. Using this we define the simulation complexity of a computable system C relative to another U giving an exact bound on their difference in error. This error in turn gives an exact upper bound on the number of predictions ν gets incorrect. 1 A prediction’s error Suppose we wish to predict a sequence over a finite alphabet X. Definition 1. [3] A semimeasure ν is a function ν:X∗ → [0, 1] satisfying: 1. Normalisation: ν( ) = 1 2. Coherence: ∑

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STATISTICAL PREDICTION OF THE SEQUENCE OF LARGE EARTHQUAKES IN IRAN

The use of different probability distributions as described by the Exponential, Pareto, Lognormal, Rayleigh, and Gama probability functions applied to estimation the time of the next great earthquake (Ms≥6.0) in different seismotectonic provinces of Iran. This prediction is based on the information about past earthquake occurrences in the given region and the basic assumption that future seismi...

متن کامل

Seismic Data Forecasting: A Sequence Prediction or a Sequence Recognition Task

In this paper, we have tried to predict earthquake events in a cluster of seismic data on pacific ring of fire, using multivariate adaptive regression splines (MARS). The model is employed as either a predictor for a sequence prediction task, or a binary classifier for a sequence recognition problem, which could alternatively help to predict an event. Here, we explain that sequence prediction/r...

متن کامل

Equivalent characterizations of partial randomness for a recursively enumerable real

A real number α is called recursively enumerable if there exists a computable , increasing sequence of rational numbers which converges to α. The randomness of a recursively enumerable real α can be characterized in various ways using each of the notions; program-size complexity, Martin-Löf test, Chaitin's Ω number, the domination and Ω-likeness of α, the universality of a computable, increasin...

متن کامل

On Semimeasures Predicting Martin-Loef Random Sequences

Solomonoff’s central result on induction is that the prediction of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating predictor μ, if the latter is computable. Hence, M is eligible as a universal sequence predictor in case of unknown μ. Despite some nearby results and proofs in the literature, the stronger result of convergence for all (Martin-Löf...

متن کامل

On semimeasures predicting Martin-Löf random sequences

Solomonoff’s central result on induction is that the prediction of a universal semimeasureM converges rapidly and with probability 1 to the true sequence generating predictor μ, if the latter is computable. Hence, M is eligible as a universal sequence predictor in case of unknown μ. Despite some nearby results and proofs in the literature, the stronger result of convergence for all (Martin-Löf)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006